An Analysis of Implicitly Year Qualified Queries
نویسندگان
چکیده
A significant fraction of search queries relate to topics that are time dependent, where the ideal result changes from one time-span to the next. Despite their prevalance and importance, such queries have been largely ignored. In this paper1, we focus on a subset of temporal queries known as implicitly year qualified queries. Such queries, which include “olympics” and “miss universe” implicitly depend on the year. We describe an efficient algorithm for automatically mining these queries using query log analysis. We apply our algorithm to a large query log consisting of over 750 million web search queries from a commercial search engine and analyze the characteristics of the mined queries. Finally, we show that web search effectiveness for certain classes of implicitly year qualified queries can be significantly improved using our proposed temporal result set reordering approach. This technical report is an extended version of [15].
منابع مشابه
Search Result Re-ranking by Feedback Control Adjustment for Time-sensitive Query
We propose a new method to rank a special category of time-sensitive queries that are year qualified. The method adjusts the retrieval scores of a base ranking function according to time-stamps of web documents so that the freshest documents are ranked higher. Our method, which is based on feedback control theory, uses ranking errors to adjust the search engine behavior. For this purpose, we us...
متن کاملSearch Engine Adaptation by Feedback Control Adjustment for Time-sensitive Query
We propose a new method to rank a special category of time-sensitive queries that are year qualified. The method adjusts the retrieval scores of a base ranking function according to time-stamps of web documents so that the freshest documents are ranked higher. Our method, which is based on feedback control theory, uses ranking errors to adjust the search engine behavior. For this purpose, we us...
متن کاملExtended Weighted Pushdown Systems
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what dataflow values hold at a program node for a particular set of calling contexts?” The generalization, however, does not account for precise handling of local variables. Extended-weighted-pushdown systems address this issue, and p...
متن کاملAnalysis of users’ query reformulation behavior in Web with regard to Wholis-tic/analytic cognitive styles, Web experience, and search task type
Background and Aim: The basic aim of the present study is to investigate users’ query reformulation behavior with regard to wholistic-analytic cognitive styles, search task type, and experience variables in using the Web. Method: This study is an applied research using survey method. A total of 321 search queries were submitted by 44 users. Data collection tools were Riding’s Cognitive Style A...
متن کاملHigh-Performance Qualified Digital Signatures for X-Road
In Estonia, the X-Road infrastructure for unified governmental database access has been in use for more than 10 years now. The number of queries mediated over the X-Road has exceeded 240 million per year. Even though all the queries and replies are signed by using the X-Road’s own PKI facilities, the resulting signatures are not fully qualified in the sense of the Digital Signatures Act. There ...
متن کامل